|
Navigation of mobile robots
Rozman, Jaroslav ; Matoušek,, Václav (referee) ; Šolc, František (referee) ; Zbořil, František (advisor)
Mobile robotics has been very discussed and wide spread topic recently. This due to the development in the computer technology that allows us to create better and more sophisticated robots. The goal of this effort is to create robots that will be able to autonomously move in the chosen environment. To achieve this goal, it is necessary for the robot to create the map of its environment, where the motion planning will occur. Nowadays, the probabilistic algorithms based on the SLAM algorithm are considered standard in the mapping in these times. This Phd. thesis deals with the proposal of the motion planning of the robot with stereocamera placed on the pan-and-tilt unit. The motion planning is designed with regard to the use of algorithms, which will look for the significant features in the pair of the images. With the use of the triangulation the map, or a model will be created. The benefits of this work can be divided into three parts. In the first one the way of marking the free area, where the robot will plan its motion, is described. The second part describes the motion planning of the robot in this free area. It takes into account the properties of the SLAM algorithm and it tries to plan the exploration in order to create the most precise map. The motion of the pan-and-tilt unit is described in the third part. It takes advantage of the fact that the robot can observe places that are in the different directions than the robot moves. This allows us to observe much bigger space without losing the information about the precision of the movements.
|
|
Multirobot Path Planning in a Dynamic System
Dokoupil, Ladislav ; Veigend, Petr (referee) ; Zbořil, František (advisor)
This thesis deals with the problem of dynamic environment search using multi-agent systems. The primary result of this work is participation in the MAPC2022 contest, but the application can be found in the exploration of unknown space, assuming finite visibility and unlimited distance of communication of the agents. After describing the current methods for solving the given problem and their limitations, an algorithm based on ant colony optimization is proposed. Graphs were then created with data from running program with various parameters. The result of work is agents synchronization improvements and overall optimization of the platform involved in the mentioned contest from previous year. As a result half more of explored space was measured compared to previous solution.
|
|
Multirobot Path Planning in a Dynamic System
Dokoupil, Ladislav ; Veigend, Petr (referee) ; Zbořil, František (advisor)
This thesis deals with the problem of dynamic environment search using multi-agent systems. The primary result of this work is participation in the MAPC2022 contest, but the application can be found in the exploration of unknown space, assuming finite visibility and unlimited distance of communication of the agents. After describing the current methods for solving the given problem and their limitations, an algorithm based on ant colony optimization is proposed. Graphs were then created with data from running program with various parameters. The result of work is agents synchronization improvements and overall optimization of the platform involved in the mentioned contest from previous year. As a result half more of explored space was measured compared to previous solution.
|
|
Path planning in realistic 3D environments
Ondrejáš, Michal ; Barták, Roman (advisor) ; Surynek, Pavel (referee)
The thesis concerns with the implementation of a 3D environment editor with path-planning functionality and Parrot AR.Drone quadrocopter control, named Drone3D. It explores the principles of creating real-time applications and drawing 3D graphics in DirectX, followed by the implementation of 3D graphics and user interface of the editor. Then multiple path-planning so- lutions are examined - algorithms and environment representation options. It is determined that the best approach is to represent the environment as a grid of cubes and use the Lazy Theta* path-planning algorithm. This system is then implemented as a part of the editor. Finally, experiments with the Parrot AR.Drone follow and a basic method of navigating the aircraft using a given or algorithmically found path is created. The method is implemented as apart of the editor and multiple tests are performed to verify and review the solution. 1
|
|
Navigation of mobile robots
Rozman, Jaroslav ; Matoušek,, Václav (referee) ; Šolc, František (referee) ; Zbořil, František (advisor)
Mobile robotics has been very discussed and wide spread topic recently. This due to the development in the computer technology that allows us to create better and more sophisticated robots. The goal of this effort is to create robots that will be able to autonomously move in the chosen environment. To achieve this goal, it is necessary for the robot to create the map of its environment, where the motion planning will occur. Nowadays, the probabilistic algorithms based on the SLAM algorithm are considered standard in the mapping in these times. This Phd. thesis deals with the proposal of the motion planning of the robot with stereocamera placed on the pan-and-tilt unit. The motion planning is designed with regard to the use of algorithms, which will look for the significant features in the pair of the images. With the use of the triangulation the map, or a model will be created. The benefits of this work can be divided into three parts. In the first one the way of marking the free area, where the robot will plan its motion, is described. The second part describes the motion planning of the robot in this free area. It takes into account the properties of the SLAM algorithm and it tries to plan the exploration in order to create the most precise map. The motion of the pan-and-tilt unit is described in the third part. It takes advantage of the fact that the robot can observe places that are in the different directions than the robot moves. This allows us to observe much bigger space without losing the information about the precision of the movements.
|